Acute Sets of Exponentially Optimal Size
نویسندگان
چکیده
منابع مشابه
The Size of Optimal Sequence Sets for Synchronous CDMA Systems
The sum capacity on a symbol-synchronous CDMA system having processing gain N and supporting K power constrained users is achieved by employing at most 2N 1 sequences. Analogously, the minimum received power (energy-per-chip) on the symbol-synchronous CDMA system supporting K users that demand specified data rates is attained by employing at most 2N 1 sequences. If there are L oversized users i...
متن کاملOptimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets
Bayesian approaches to utility elicitation typically adopt (myopic) expected value of information (EVOI) as a natural criterion for selecting queries. However, EVOI-optimization is usually computationally prohibitive. In this paper, we examine EVOI optimization using choice queries, queries in which a user is ask to select her most preferred product from a set. We show that, under very general ...
متن کاملThe Size of Sets With
Let n be a nonzero integer and a1 < a2 < · · · < am positive integers such that aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. It is known that m ≤ 5 for n = 1. In this paper we prove that m ≤ 31 for |n| ≤ 400 and m < 15.034 log |n| for |n| > 400.
متن کاملExponentially Vanishing Sub-optimal Local Minima in Multilayer Neural Networks
Background: Statistical mechanics results (Dauphin et al. (2014); Choromanska et al. (2015)) suggest that local minima with high error are exponentially rare in high dimensions. However, to prove low error guarantees for Multilayer Neural Networks (MNNs), previous works so far required either a heavily modified MNN model or training method, strong assumptions on the labels (e.g., “near” linear ...
متن کاملSparse Graphs Usually Have Exponentially Many Optimal Colorings
A proper coloring of a graph G = (V,E) is called optimal if the number of colors used is the minimal possible; i.e., it coincides with the chromatic number of G. We investigate the typical behavior of the number of distinct optimal colorings of a random graph G(n, p), for various values of the edge probability p = p(n). Our main result shows that for every constant 1/3 < a < 2, most of the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2018
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-018-9985-0